Problem set - PDFSEARCH.IO - Document Search Engine

Problem set
Results: 1590

#	Item
831	Astro 321: Problem Set 4 Due Feb 4 This problem set develops a piece of the standard toolkit for structure formation calculations. The motivation of some pieces may seem mysterious for now, but save the codes you build h Add to Reading List Source URL: background.uchicago.edu Language: English - Date: 2011-08-15 18:34:55 Explorer program Wilkinson Microwave Anisotropy Probe Electrical resistivities of the elements Spacecraft Spaceflight Space technology
832	Astro 321: Problem Set 7 Due Mar 4 CAMB, CMB Power Spectra, Baryon Effects Goto camb.info, download and compile the CAMB Einstein-Boltzmann code. Run the Ωm = 0.27, h = 0.7, n = 0.966, AS = (4.657 × 10−5 )2 , Ωb h Add to Reading List Source URL: background.uchicago.edu - Date: 2011-08-15 18:34:55
833	cccg-cluster_visibility-2.dvi Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 NP-complete problems Art gallery problem Steiner tree problem Vertex Connectivity Pseudotriangle Tree Graph Dominating set Graph theory Mathematics Theoretical computer science
834	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Shortest Descending Paths through Given Faces Mustaq Ahmed∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:57:13 Network theory Geodesic Shortest path problem Convex set Applied mathematics Mathematics Theoretical computer science Convex analysis
835	CS 373 Final Exam (December 15, 2000) Fall 2000 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:10 Complexity classes NP-complete problems Mathematical optimization NP-hard Time complexity NP Independent set P versus NP problem Clique Theoretical computer science Computational complexity theory Applied mathematics
836	ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic276 Fixed-parameter tractability and completeness IV: Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:20:30 Complexity classes NP-complete problems Structural complexity theory Mathematical optimization Parameterized complexity Dominating set P versus NP problem NP-complete Combinatory logic Theoretical computer science Computational complexity theory Applied mathematics
837	A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:58:37 NP-complete problems Combinatorics Analysis of algorithms Set packing Randomized algorithm Disjoint-set data structure Parameterized complexity Set cover problem Dominating set Theoretical computer science Computational complexity theory Mathematics
838	Problem Set SOLUTIONS: Heliophysics Textbook III: Chapter 5 SOLUTIONS Homework Exercise Solar Convection and the Solar Dynamo Mark Miesch (HAO/NCAR) Add to Reading List Source URL: www.heliophysics.ucar.edu Language: English - Date: 2015-01-04 14:54:26 Petroleum engineering Viscosity Vector space Constructible universe Spectral theory of ordinary differential equations Algebra Mathematics Oilfield terminology
839	Astro 321: Problem Set 6 Due Feb 25 Slow Roll Relations Recall the equation of motion for the unperturbed scalar field a˙ Add to Reading List Source URL: background.uchicago.edu Language: English - Date: 2011-08-15 18:34:55 Inflation Physical cosmology
840	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Geometric Red-Blue Set Cover for Unit Squares and Related Problems Timothy M. Chan∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Vertex cover Set cover problem Monotone polygon NP-complete problems Mathematics Applied mathematics

UPDATE